The Extended Analog Computer and Turing machine Monika Piekarz
نویسنده
چکیده
In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation proposed by D.S. Graça, M.L. Campagnolo and J. Buescu [1] in 2005.
منابع مشابه
The Extended Analog Computer and Turing machine
In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...
متن کاملThe Extended Analog Computer and Turing machine Monika
In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...
متن کاملAnnales UMCS Informatica AI 7 ( 2007 ) 37 - 47 Annales UMCS Informatica
In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...
متن کاملThe Extended Analog Computer and Functions Computable in a Digital Sense
Analog computation as the study of computation capabilities of continuoustime dynamical systems described by means of differential equations got a resurgence of interest in the last decade after a new glimpse of Cris Moore in [A] on the work of Shanon ([21]), Marion B. Pour-El ([15]), and Lee A. Rubel ([20]). Papers such as [9], [7] and [8], but others not cited by Monika Piekarz, succeeded in ...
متن کاملThree simulations of Turing machines with the use of real recursive functions
Three simulation algorithms of Turing machines by means of real recursive functions are proposed. Moore’s shifting mapping GS is used to this end. The relationship between a simulation dimension and classes of η -hierarchy is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018